A Shortest Path Approach to a Multifacility Minimax Location Problem with Rectilinear Distances
نویسنده
چکیده
The multifacility minimax location problem with rectilinear distances is considered. It is reduced to a parametric shortest path problem in a network with no negative length arcs. The reduction scheme contributes to this location problem and yields an efficient algorithm with time complexity 0 (n max(m log m, n3 )) where n and m denote the numbers of the new and existing facilitie,s in the plane, respectively. For a special case the time bound is further reducible to 0 (n max(m, n ».
منابع مشابه
Multifacility Minimax Location Problems via Multi-Composed Optimization
We present a conjugate duality approach for multifacility minimax location problems with geometric constraints, where the underlying space is Fréchet and the distances are measured by gauges of closed convex sets. Besides assigning corresponding conjugate dual problems, we derive necessary and sufficient optimality conditions. Moreover, we introduce a further dual problem with less dual variabl...
متن کاملSolution of Backup Multifacility Location Problem by Considering the Ideal Radius for each Customer
In this paper we introduce a new facility location model, called backup multifacility location problem by considering the ideal radius for each customer. In this problem the location of clients are given in the plane. A radius is assigned to each client. We should find the location of new facilities, which some of them may fail with a given probability, such that the sum of weighted distances f...
متن کاملRectilinear Path Problems among Rectilinear Obstacles Revisited
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
متن کاملA Multifacility Location Problem on Median Spaces
This paper is concerned with the problem of locating II new facilities in the median space when there are k facilities already located. The objective is to minimize the weighted sum of distances. Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems. The complexit...
متن کاملMixed planar and network single-facility location problems
We consider the problem of optimally locating a single facility anywhere in a network to serve both on-network and off-network demands. Off-network demands occur in a Euclidean plane, while on-network demands are restricted to a network embedded in the plane. On-network demand points are serviced using shortest-path distances through links of the network (e.g., on-road travel), whereas demand p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009